Reasoning with conditional axioms
Identifieur interne : 00C714 ( Main/Exploration ); précédent : 00C713; suivant : 00C715Reasoning with conditional axioms
Auteurs : Emmanuel Kounalis [France] ; Michaël Rusinowitch [France]Source :
- Annals of Mathematics and Artificial Intelligence [ 1012-2443 ] ; 1995-06-01.
English descriptors
- Teeft :
- Academic press, Artificial intelligence, Axiom, Bendix procedure, Canonical systems, Clause, Comp, Complete simplification, Completeness theorem, Completion procedure, Computer science, Conditional, Conditional axioms, Conditional equation, Conditional equations, Conditional rule, Conditional rules, Conditional simplification, Conditional theories, Conditional theory, Deductive theorem, Empty clause, Equational, Equational theories, Explicit induction, Failure node, Failure nodes, Fair derivation, First part, First step, First version, Formal definition, Full power, Function symbols, General unifier, Ground convergent, Ground equation, Ground instance, Ground instances, Ground substitution, Ground term, Ground terms, Herbrand, Herbrand base, Herbrand model, Herbrand models, Horn clause, Horn clauses, Horn theories, Implicit induction, Induction, Induction hypothesis, Inductive, Inductive hypothesis, Inductive reasoning, Inductive theorem, Inductive theorems, Inference, Inference rules, Inference steps, Inference system, Initial model, Initial models, Irreducible, Irreducible ground terms, Kounalis, Last node, Lecture notes, Lexicographic path, Main idea, Maximal path, Multiset extension, Next proposition, Next result, Next section, Node, Paramodulation, Partial interpretation, Preliminary version, Previous work, Proc, Recursive path, Reductive, Reductive rules, Reflexive closure, Resolution principle, Resp, Rusinowitch, Second part, Simplification, Springer, Strict position, Strong restrictions, Structural induction, Substitution, Subterm, Superposition, Test sets, Test substitution, Unconditional equation, Unsatisfiable.
Abstract
Abstract: We present methods for automatically proving theorems in theories axiomatized by a set of Horn clauses. These methods address both deductive and inductive reasoning. They are based on the concept of simplification and require minimal human interaction.
Url:
DOI: 10.1007/BF01534452
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002B99
- to stream Istex, to step Curation: 002B62
- to stream Istex, to step Checkpoint: 002B29
- to stream Main, to step Merge: 00CF71
- to stream Main, to step Curation: 00C714
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Reasoning with conditional axioms</title>
<author><name sortKey="Kounalis, Emmanuel" sort="Kounalis, Emmanuel" uniqKey="Kounalis E" first="Emmanuel" last="Kounalis">Emmanuel Kounalis</name>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:B964DE430B457C7A1D783CAF203CA21CC325E04F</idno>
<date when="1995" year="1995">1995</date>
<idno type="doi">10.1007/BF01534452</idno>
<idno type="url">https://api.istex.fr/ark:/67375/1BB-Q2GMK243-T/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002B99</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002B99</idno>
<idno type="wicri:Area/Istex/Curation">002B62</idno>
<idno type="wicri:Area/Istex/Checkpoint">002B29</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002B29</idno>
<idno type="wicri:doubleKey">1012-2443:1995:Kounalis E:reasoning:with:conditional</idno>
<idno type="wicri:Area/Main/Merge">00CF71</idno>
<idno type="wicri:Area/Main/Curation">00C714</idno>
<idno type="wicri:Area/Main/Exploration">00C714</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Reasoning with conditional axioms</title>
<author><name sortKey="Kounalis, Emmanuel" sort="Kounalis, Emmanuel" uniqKey="Kounalis E" first="Emmanuel" last="Kounalis">Emmanuel Kounalis</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Laboratoire d'Informatique I3S, 250 rue Albert Einstein, 06560, Valbonne</wicri:regionArea>
<placeName><region type="region" nuts="2">Provence-Alpes-Côte d'Azur</region>
<settlement type="city">Valbonne</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>CRIN-INRIA Lorraine, B.P. 239, 54506, Vandœuvre les Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Annals of Mathematics and Artificial Intelligence</title>
<title level="j" type="abbrev">Ann Math Artif Intell</title>
<idno type="ISSN">1012-2443</idno>
<idno type="eISSN">1573-7470</idno>
<imprint><publisher>Kluwer Academic Publishers</publisher>
<pubPlace>Dordrecht</pubPlace>
<date type="published" when="1995-06-01">1995-06-01</date>
<biblScope unit="volume">15</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="page" from="125">125</biblScope>
<biblScope unit="page" to="149">149</biblScope>
</imprint>
<idno type="ISSN">1012-2443</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">1012-2443</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Academic press</term>
<term>Artificial intelligence</term>
<term>Axiom</term>
<term>Bendix procedure</term>
<term>Canonical systems</term>
<term>Clause</term>
<term>Comp</term>
<term>Complete simplification</term>
<term>Completeness theorem</term>
<term>Completion procedure</term>
<term>Computer science</term>
<term>Conditional</term>
<term>Conditional axioms</term>
<term>Conditional equation</term>
<term>Conditional equations</term>
<term>Conditional rule</term>
<term>Conditional rules</term>
<term>Conditional simplification</term>
<term>Conditional theories</term>
<term>Conditional theory</term>
<term>Deductive theorem</term>
<term>Empty clause</term>
<term>Equational</term>
<term>Equational theories</term>
<term>Explicit induction</term>
<term>Failure node</term>
<term>Failure nodes</term>
<term>Fair derivation</term>
<term>First part</term>
<term>First step</term>
<term>First version</term>
<term>Formal definition</term>
<term>Full power</term>
<term>Function symbols</term>
<term>General unifier</term>
<term>Ground convergent</term>
<term>Ground equation</term>
<term>Ground instance</term>
<term>Ground instances</term>
<term>Ground substitution</term>
<term>Ground term</term>
<term>Ground terms</term>
<term>Herbrand</term>
<term>Herbrand base</term>
<term>Herbrand model</term>
<term>Herbrand models</term>
<term>Horn clause</term>
<term>Horn clauses</term>
<term>Horn theories</term>
<term>Implicit induction</term>
<term>Induction</term>
<term>Induction hypothesis</term>
<term>Inductive</term>
<term>Inductive hypothesis</term>
<term>Inductive reasoning</term>
<term>Inductive theorem</term>
<term>Inductive theorems</term>
<term>Inference</term>
<term>Inference rules</term>
<term>Inference steps</term>
<term>Inference system</term>
<term>Initial model</term>
<term>Initial models</term>
<term>Irreducible</term>
<term>Irreducible ground terms</term>
<term>Kounalis</term>
<term>Last node</term>
<term>Lecture notes</term>
<term>Lexicographic path</term>
<term>Main idea</term>
<term>Maximal path</term>
<term>Multiset extension</term>
<term>Next proposition</term>
<term>Next result</term>
<term>Next section</term>
<term>Node</term>
<term>Paramodulation</term>
<term>Partial interpretation</term>
<term>Preliminary version</term>
<term>Previous work</term>
<term>Proc</term>
<term>Recursive path</term>
<term>Reductive</term>
<term>Reductive rules</term>
<term>Reflexive closure</term>
<term>Resolution principle</term>
<term>Resp</term>
<term>Rusinowitch</term>
<term>Second part</term>
<term>Simplification</term>
<term>Springer</term>
<term>Strict position</term>
<term>Strong restrictions</term>
<term>Structural induction</term>
<term>Substitution</term>
<term>Subterm</term>
<term>Superposition</term>
<term>Test sets</term>
<term>Test substitution</term>
<term>Unconditional equation</term>
<term>Unsatisfiable</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We present methods for automatically proving theorems in theories axiomatized by a set of Horn clauses. These methods address both deductive and inductive reasoning. They are based on the concept of simplification and require minimal human interaction.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
<li>Provence-Alpes-Côte d'Azur</li>
</region>
<settlement><li>Valbonne</li>
<li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Provence-Alpes-Côte d'Azur"><name sortKey="Kounalis, Emmanuel" sort="Kounalis, Emmanuel" uniqKey="Kounalis E" first="Emmanuel" last="Kounalis">Emmanuel Kounalis</name>
</region>
<name sortKey="Kounalis, Emmanuel" sort="Kounalis, Emmanuel" uniqKey="Kounalis E" first="Emmanuel" last="Kounalis">Emmanuel Kounalis</name>
<name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C714 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C714 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:B964DE430B457C7A1D783CAF203CA21CC325E04F |texte= Reasoning with conditional axioms }}
This area was generated with Dilib version V0.6.33. |